Перевод: с французского на все языки

со всех языков на французский

(matching) set

См. также в других словарях:

  • matching — 1. adjective /ˈmætʃɪŋ/ The same as another; sharing the same design. A matching set of furniture 2. noun /ˈmætʃɪŋ/ A set of independent edges in a given graph, i.e. a set of edges which do not intersect: so called because pairs of vertices are… …   Wiktionary

  • set — {{Roman}}I.{{/Roman}} noun 1 group of similar things ADJECTIVE ▪ complete, entire, full, whole ▪ broad, comprehensive, huge, large …   Collocations dictionary

  • Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… …   Wikipedia

  • Matching — may refer to: Matching (graph theory), in graph theory, a set of edges without common vertices Matching (statistics), a technique for reducing bias when analyzing data from observational studies String matching, in computer science Matchmaking,… …   Wikipedia

  • Matching (disambiguation) — Matching may refer to:* Matching, in graph theory, a set of edges without common vertices * String matching * Impedance matching and Impedance bridging, in electronics, attempting to make the output impedance of a source equal to the input… …   Wikipedia

  • set — [set] vt. set, setting [ME setten < OE settan (akin to Ger setzen & Goth satjan < Gmc * satjan), caus. formation “to cause to sit” < base of SIT] 1. to place in a sitting position; cause to sit; seat 2. a) to cause (a fowl) to sit on… …   English World dictionary

  • Set Enterprises — is a card game publishing company based in Fountain Hills, Arizona. Set Enterprises produces several different dedicated deck card games and has won several Mensa Select awards from American Mensa for its games [… …   Wikipedia

  • Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… …   Wikipedia

  • Matching law — In operant conditioning, the matching law is a quantitative relationship that holds between the relative rates of response and the relative rates of reinforcement in concurrent schedules of reinforcement. It applies reliably when non human… …   Wikipedia

  • Matching preclusion — In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion results in the destruction of a perfect matching or near perfect matching (a matching that covers… …   Wikipedia

  • Matching, Essex — Coordinates: 51°47′06″N 0°12′34″E / 51.784982°N 0.209478°E / 51.784982; 0.209478 …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»